A Meta-heuristic Algorithm for the Strip Rectangular Packing Problem
نویسندگان
چکیده
A new meta-heuristic algorithm to find the minimum height for twodimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than known meta-heuristic but also runs in shorter time.
منابع مشابه
A new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملA new heuristic recursive algorithm for the strip rectangular packing problem
A fast and new heuristic recursive algorithm to find a minimum height for two-dimensional strip rectangular packing problem is presented. This algorithm is mainly based on heuristic strategies and a recursive structure, and its average running time is T (n)= (n3). The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than the kno...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملMetaheuristics International Conference ? ? - 1 GRASP heuristic for the strip packing problem ∗
The rectangular Strip Packing Problem (SPP) consists of packing a given set of rectangles in a rectangular strip with fixed width w and variable height minimizing the height of the packing. In this work we propose a ”Greedy Randomized and Adaptive Constructive” heuristic, a GRASP metaheuristic without the post-processing phase, for the SPP in the version where the rectangles can be freely rotat...
متن کاملA Review of the Application of Swarm Intelligence Algorithms to 2D Cutting and Packing Problem
Cutting and packing (C & P) problem is to allocate a set of items to larger rectangular standardized units by minimizing the waste. Bin packing, strip packing and cutting stock problem is well-known classical C & P problem. An overview is provided of several meta-heuristics algorithms of swarm intelligence from the literature for the 2D C & P problem. The objective of this paper is to present a...
متن کامل